New Construction of Even-variable Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity
نویسندگان
چکیده
The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( / 4 3) n different rotation symmetric Boolean functions which achieve both optimum algebraic immunity and high nonlinearity when an even ( 16) n n is given.
منابع مشابه
Construction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity Construcción de Funciones Booleanas de Rotación Simétrica con Inmunidad Algebraica Óptima
In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with the maximum possible algebraic immunity. To get high nonlinearity, we generalize our construction to a search technique in the RSBF class. We present RSBFs with the maximum algebraic immunity and high nonlinearity for odd number of variables. We also study the RSBF...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملConstruction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible AI and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI . To get very good nonlinearity, which is important for practical cryptographic design, we g...
متن کاملOn the immunity of rotation symmetric Boolean functions against fast algebraic attacks
In this paper, it is shown that an n-variable rotation symmetric Boolean function f with n even but not a power of 2 admits a rotation symmetric function g of degree at most e ≤ n/3 such that the product gf has degree at most n− e− 1.
متن کاملLower Bounds on Algebraic Immunity of Boolean Functions
In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014